How to check numerically the sufficient optimality conditions for infinite-dimensional optimization problems

نویسندگان

  • Daniel Wachsmuth
  • Arnd Rösch
چکیده

We consider general non-convex optimal control problems. Many results for such problems rely on second-order sufficient optimality conditions. We propose a method to verify whether the second-order sufficient optimality conditions hold in a neighborhood of a numerical solution. This method is then applied to abstract optimal control problems. Finally, we consider an optimal control problem subject to a semi-linear elliptic equation that appears to have multiple local minima. Mathematics Subject Classification (2000). Primary 49J20; Secondary 49K20, 65N15.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularity Conditions for Non-Differentiable Infinite Programming Problems using Michel-Penot Subdifferential

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are locally Lipschitz‎. ‎Necessary optimality conditions and regularity conditions are given‎. ‎Our approach are based on the Michel-Penot subdifferential.

متن کامل

Mangasarian-Fromovitz and Zangwill Conditions For Non-Smooth Infinite Optimization problems in Banach Spaces

In this paper we study optimization problems with infinite many inequality constraints on a Banach space where the objective function and the binding constraints are Lipschitz near the optimal solution. Necessary optimality conditions and constraint qualifications in terms of Michel-Penot subdifferential are given.

متن کامل

New optimality conditions for multiobjective fuzzy programming problems

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

متن کامل

Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...

متن کامل

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008